package com.binaryTree;

public class MaximumDepthofBinaryTree0301_104 {
    public int maxDepth(TreeNode root) {
        if(root == null) return 0;
        int left = maxDepth(root.left);
        int right = maxDepth(root.right);
        int res = Math.max(left,right) + 1;
        return res;
    }
}
